Asymptotic cycles

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic cycles

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. 1. Introduction [4] Let X be a topological space, G a topo...

متن کامل

Hausdorff Dimension and Asymptotic Cycles

We carry out a multifractal analysis for the asymptotic cycles for compact Riemman surfaces of genus g ≥ 2. This describes the set of unit tangent vectors for which the associated orbit has a given asymptotic cycle in homology.

متن کامل

Asymptotic Statistics of Cycles in Surrogate-spatial Permutations

We propose an extension of the Ewens measure on permutations by choosing the cycle weights to be asymptotically proportional to the degree of the symmetric group. This model is primarily motivated by a natural approximation to the so-called spatial random permutations recently studied by V. Betz and D. Ueltschi (hence the name “surrogatespatial”), but it is of substantial interest in its own ri...

متن کامل

Asymptotic expansion for cycles in homology classes for graphs

In this paper we give an asymptotic expansion including error terms for the number of cycles in homology classes for connected graphs. Mainly, we obtain formulae about the coefficients of error terms which depend on the homology classes and give two examples of how to calculate the coefficient of first error term. 2000 Mathematics Subject Classification. 37C27, 37C30, 37D05.

متن کامل

Regular Hypergraphs: Asymptotic Counting and Loose Hamilton Cycles

We present results from two papers by the authors on analysis of d-regular k-uniform hypergraphs, when k is fixed and the number n of vertices tends to infinity. The first result is approximate enumeration of such hypergraphs, provided d = d(n) = o(nκ), where κ = κ(k) = 1 for all k ≥ 4, while κ(3) = 1/2. The second result is that a random d-regular hypergraph contains as a dense subgraph the un...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scholarpedia

سال: 2008

ISSN: 1941-6016

DOI: 10.4249/scholarpedia.5463